Bubble Sort Visualizer

Bubble Sort is a simple comparison-based sorting algorithm. It works by repeatedly stepping through the list, comparing adjacent elements and swapping them if they are in the wrong order. The pass through the list is repeated until no more swaps are needed, which means the list is sorted.

1. Start with the first element and compare it with the next element. If the first element is greater than the second element, swap them.
2. Move to the next pair of adjacent elements and repeat the comparison and swapping if necessary.
3. Continue this process until the end of the array is reached.
4. Repeat the above steps for each pass through the array until no more swaps are needed.

Complexity Analysis of Bubble Sort

Time Complexity: O(n²) in worst and average cases:

• Best Case (already sorted): O(n)
• Average Case: O(n²)
• Worst Case (reverse sorted): O(n²)
• Space Complexity: O(1) as only a single additional memory space is required

Usage Tips:

• Enter positive numbers separated by commas (e.g., 5, 10, 15)
• Maximum recommended input: 125
• Maximum array size: 50 numbers
• Larger numbers will be automatically scaled to fit the display